Estimating Individual Tree Growth with the k-Nearest Neighbour and k-Most Similar Neighbour Methods

نویسندگان

  • Susanna Sironen
  • Annika Kangas
  • Matti Maltamo
  • Jyrki Kangas
چکیده

The purpose of this study was to examine the use of non-parametric methods in estimating tree level growth models. In non-parametric methods the growth of a tree is predicted as a weighted average of the values of neighbouring observations. The selection of the nearest neighbours is based on the differences between tree and stand level characteristics of the target tree and the neighbours. The data for the models were collected from the areas owned by Kuusamo Common Forest in Northeast Finland. The whole data consisted of 4051 tally trees and 1308 Scots pines (Pinus sylvestris L.) and 367 Norway spruces (Picea abies Karst.). Models for 5-year diameter growth and bark thickness at the end of the growing period were constructed with two different non-parametric methods: the k-nearest neighbour regression and k-Most Similar Neighbour method. Diameter at breast height, tree height, mean age of the stand and basal area of the trees larger than the subject tree were found to predict the diameter growth most accurately. The non-parametric methods were compared to traditional regression growth models and were found to be quite competitive and reliable growth estimators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some improvements on NN based classifiers in metric spaces

The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search may become unpractical when facing large training sets, high dimensional data or expensive dissimilarity measures (distances). During the last years a lot of fast NN search algorithms have been d...

متن کامل

Spam Classification Using Nearest Neighbour Techniques

Spam mail classification and filtering is a commonly investigated problem, yet there has been little research into the application of nearest neighbour classifiers in this field. This paper examines the possibility of using a nearest neighbour algorithm for simple, word based spam mail classification. This approach is compared to a neural network, and decision-tree along with results published ...

متن کامل

Eecient Nearest-neighbour Searches Using Weighted Euclidean Metrics

Building an index tree is a common approach to speed up the k nearest neighbour search in large databases of many-dimensional records. Many applications require varying distance metrics by putting a weight on diierent dimensions. The main problem with k nearest neighbour searches using weighted euclidean metrics in a high dimensional space is whether the searches can be done eeciently We presen...

متن کامل

Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification

The nearest neighbour (NN) and k-nearest neighbour (kNN) classi cation rules have been widely used in pattern recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search can become unpractical when facing large training sets, high dimensional data or expensive similarity measures. In the last years a lot of NN search algorithms have been developed to overcome those...

متن کامل

Comparison of airborne laser scanning methods for estimating forest structure indicators based on Lorenz curves

rization of vegetation, airborne laser scanning (ALS) remote nsing allows for evaluating properties related to forest structure broad forest areas (Lefsky et al., 2005; Maltamo et al., 2005). ese properties can be exploited to study forest successional ages (Falkowski et al., 2009; Valbuena et al., 2013a), the risk of ild fire propagation (Andersen et al., 2005; Hall et al., 2005) or ind-throw ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001